Multiagent Learning Model in Grid
نویسندگان
چکیده
For improving the efficiency of resource use in dynamic network environment, the computational model base on multiagent is adopted, and an effective learning model based on the reinforcement learning and the multi-level organization learning is proposed in this paper. A series of formal definitions, such as the dynamic network grid (DNG), the computing agent, the cooperation computing team and the relations among them, were given. The rules are classified into the basic rules, the static rules and the dynamic rues. Using the generation technique of dynamic knowledge, the knowledge revision technique based on the reinforcement learning and the learning framework based on multi-level organizations of agents, the learning model was studied. The migration learning process was described in DNG. The experiment results show that this model resolves effectively the problems of optimization use of resources in DNG. It can be fit for grid computing and pervasive computing.
منابع مشابه
A Multiagent Reinforcement Learning algorithm to solve the Community Detection Problem
Community detection is a challenging optimization problem that consists of searching for communities that belong to a network under the assumption that the nodes of the same community share properties that enable the detection of new characteristics or functional relationships in the network. Although there are many algorithms developed for community detection, most of them are unsuitable when ...
متن کاملTowards a Decision Framework for the Use of Multiagent Systems in OGSA Compliant Grid Middleware
Implementing and using Grids requires a suitable Grid middleware. A reference model for the architecture of Grid middleware is the Open Grid Service Architecture (OGSA) which proposes a service-oriented architecture based on Web service technologies. As a consequence, the potential of such OGSA compliant Grid middleware is limited by the capabilities of Web service technologies. Recently, multi...
متن کاملAdaptive Multiagent Q-Learning with Initial Heuristic Approximation
The problem of effective coordination learning of multiple autonomous agents in a multiagent system (MAS) is one of the most complex challenges in artificial intelligence because of two principal cumbers: non-stationarity of the environment and exponential growth of its dimensionality with number of agents. Non-stationarity of the environment is due to the dependence of the transition function ...
متن کاملAn argumentation framework for learning, information exchange, and joint-deliberation in multi-agent systems
Case-Based Reasoning (CBR) can give agents the capability of learning from their own experience and solve new problems, however, in a multi-agent system, the ability of agents to collaborate is also crucial. In this paper we present an argumentation framework (AMAL) designed to provide learning agents with collaborative problem solving (joint deliberation) and information sharing capabilities (...
متن کاملLabeled Initialized Adaptive Play Q-learning for Stochastic Games
Recently, initial approximation of Q-values of the multiagent Q-learning by the optimal single-agent Q-values has shown good results in reducing the complexity of the learning process. In this paper, we continue in the same vein and give a brief description of the Initialized Adaptive Play Q-learning (IAPQ) algorithm while establishing an effective stopping criterion for this algorithm. To do t...
متن کامل